منابع مشابه
Time and Space Complexity Reduction of a Cryptanalysis Algorithm
Binary Decision Diagram (in short BDD) is an efficient data structure which has been used widely in computer science and engineering. BDD-based attack in key stream cryptanalysis is one of the best forms of attack in its category. In this paper, we propose a new key stream attack which is based on ZDD(Zero-suppressed BDD). We show how a ZDD-based key stream attack is more efficient in time and ...
متن کاملTime and Space Complexity Reduction of a Cryptanalysis Algorithm
Binary Decision Diagram (in short BDD) is an efficient data structure which has been used widely in computer science and engineering. BDD-based attack in key stream cryptanalysis is one of the best forms of attack in its category. In this paper, we propose a new key stream attack which is based on ZDD(Zero-suppressed BDD). We show how a ZDD-based key stream attack is more efficient in time and ...
متن کاملFields and Objects in Space, Time, and Space-time
The well-known distinction between field-based and object-based approaches to spatial information is generalised to arbitrary locational frameworks, including in particular space, time and space-time. We systematically explore the different ways in which these approaches can be combined, and address the relative merits of a fully four-dimensional approach as against a more conventional ‘three-p...
متن کاملMemory of metropolis / remembering and forgetting in metropolis
The word ‘Metropolis’ is a shorter version of the word ‘meterpolis’, itself derived from the Greek word ‘meter’ (mother) and polis (city, town). It is identified as the ‘center city’ which is more developed than other cities in terms of culture and economy (1). Hence, the metropolis is a depiction of hybridity and multi-layering; and while it is related to the city, it is not solely derived fro...
متن کاملOn characterizations of Metropolis type algorithms in continuous time
In the continuous time framework, a new definition is proposed for the Metropolis algorithm (X̃t)t≥0 associated to an a priori given exploratory Markov process (Xt)t≥0 and to a tarjet probability distribution π. It should be the minimizer for the relative entropy of the trajectorial law of (X̃t)t∈[0,T ] with respect to the law of (Xt)t∈[0,T ], when both processes start with π as initial law and w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: GEOUSP: Espaço e Tempo (Online)
سال: 2002
ISSN: 2179-0892,1414-7416
DOI: 10.11606/issn.2179-0892.geousp.2002.123780